- predicate calculus language
- язык исчисления предикатов
English-Russian dictionary of mechanical engineering and automation. - RUSSO. B.S. Voskoboinikov, V.L. Mitrovich. 2003.
English-Russian dictionary of mechanical engineering and automation. - RUSSO. B.S. Voskoboinikov, V.L. Mitrovich. 2003.
Monadic predicate calculus — In logic, the monadic predicate calculus is the fragment of predicate calculus in which all predicate letters are monadic (that is, they take only one argument), and there are no function letters. All atomic formulae have the form P(x), where P… … Wikipedia
Calculus (disambiguation) — Calculus is Latin for pebble, and has a number of meanings in English: In mathematics and computer science Calculus , in its most general sense, is any method or system of calculation. To modern theoreticians the answer to the question what is a… … Wikipedia
Language of thought — Jerry A. Fodor s Language of Thought (LOT) hypothesis states that cognition and cognitive processes are only remotely plausible when expressed as computational in terms of representational systems. He uses empirical data drawn from linguistics… … Wikipedia
Language of thought hypothesis — In philosophy of mind, the language of thought hypothesis (LOTH) put forward by American philosopher Jerry Fodor describes thoughts as represented in a language (sometimes known as mentalese) that allows complex thoughts to be built up by… … Wikipedia
calculus — /kal kyeuh leuhs/, n., pl. calculi / luy /, calculuses. 1. Math. a method of calculation, esp. one of several highly systematic methods of treating problems by a special system of algebraic notations, as differential or integral calculus. 2.… … Universalium
Predicate transformer semantics — is an extension of Floyd Hoare Logic invented by Dijkstra and extended and refined by other researchers. It was first introduced in Dijkstra s paper Guarded commands, nondeterminacy and formal derivation of programs . It is a method for defining… … Wikipedia
Predicate functor logic — In mathematical logic, predicate functor logic (PFL) is one of several ways to express first order logic (formerly known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic… … Wikipedia
Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… … Wikipedia
Ontology language — In computer science and artificial intelligence, ontology languages are formal languages used to construct ontologies. They allow the encoding of knowledge about specific domains and often include reasoning rules that support the processing of… … Wikipedia
Epsilon calculus — Hilbert s epsilon calculus is an extension of a formal language by the epsilon operator, where the epsilon operator substitutes for quantifiers in that language as a method leading to a proof of consistency for the extended formal language. The… … Wikipedia
artificial intelligence programming language — a computer language developed expressly for implementing artificial intelligence (AI) research. In the course of their work on the Logic Theorist and GPS, two early AI programs, Allen Newell (Newell, Allen) and J. Clifford Shaw of the Rand… … Universalium